A survey of results for sequencing problems with controllable processing times
نویسندگان
چکیده
منابع مشابه
A survey of scheduling with controllable processing times
In classical deterministic scheduling problems, the job processing times are assumed to be constant parameters. In many practical cases, however, processing times are controllable by allocating a resource (that may be continuous or discrete) to the job operations. In such cases, each processing time is a decision variable to be determined by the scheduler, who can take advantage of this flexibi...
متن کاملScheduling with Controllable Processing Times
In today's industrial world, demand nature is changing where the customers are looking for a high variety of products. In order to meet varying customer demands, the firms should be flexible enough to produce parts in an efficient way. The flexible manufacturing systems have emerged with the progress in manufacturing technology. A flexible manufacturing system (FMS) is a computer-controlled pro...
متن کاملJob Shop Scheduling Problems with Controllable Processing Times
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial...
متن کاملBuilding a Multi-Objective Model for Multi-Product Multi-Period Production Planning with Controllable Processing Times: A Real Case Problem
Model building is a fragile and complex process especially in the context of real cases. Each real case problem has its own characteristics with new concepts and conditions. A correct model should have some essential characteristics such as: being compatible with real conditions, being of sufficient accuracy, being logically traceable and etc. This paper discusses how to build an efficient mode...
متن کاملA Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing
In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90105-l